Słociński–Wold decompositions for row isometries
نویسندگان
چکیده
Abstract Słociński gave sufficient conditions for commuting isometries to have a nice Wold-like decomposition. In this note, we provide analogous results row satisfying certain commutation relations. Other than known doubly isometries, Wold decomposition based on the Lebesgue of isometries.
منابع مشابه
Noncommutative Wold Decompositions for Semigroups of Isometries
The structure of the isometric representations of unital discrete semi-groups with the left cancellation property and no divisors of the identity is studied. We obtain Wold decompositions and prove that the left regular representation of such semigroups is irreducible.
متن کاملIsometries and Approximate Isometries
Some properties of isometric mappings as well as approximate isometries are studied. 2000 Mathematics Subject Classification. Primary 46B04. 1. Isometry and linearity. Mazur and Ulam [17] proved the following well-known result concerning isometries, that is, transformations which preserve distances. Theorem 1.1. Given two real normed vector spaces X and Y , let U be a surjective mapping from X ...
متن کاملOn isometries for convolutional codes
In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are certain types of monomial transformations. We will show a form of MacWilliams Equivalence Theorem, that is, each isometry between convolutional codes is given by...
متن کاملIsometries for the Carathéodory Metric
Given two open unit balls B1 and B2 in complex Banach spaces, we consider a holomorphic mapping f : B1 → B2 such that f(0) = 0 and f ′(0) is an isometry. Under some additional hypotheses on the Banach spaces involved, we prove that f(B1) is a complex closed analytic submanifold of B2.
متن کاملRow by row methods for semidefinite programming
We present a row-by-row (RBR) method for solving semidefinite programming (SDP) problem based on solving a sequence of problems obtained by restricting the n-dimensional positive semidefinite constraint on the matrix X. By fixing any (n − 1)-dimensional principal submatrix of X and using its (generalized) Schur complement, the positive semidefinite constraint is reduced to a simple second-order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian mathematical bulletin
سال: 2022
ISSN: ['1496-4287', '0008-4395']
DOI: https://doi.org/10.4153/s0008439522000686